Cluster Monte Carlo algorithm for the quantum rotor model
نویسندگان
چکیده
منابع مشابه
Cluster Monte Carlo algorithm for the quantum rotor model.
We propose a highly efficient "worm"-like cluster Monte Carlo algorithm for the quantum rotor model in the link-current representation. We explicitly prove detailed balance for the algorithm even in the presence of disorder. For the pure quantum rotor model with mu=0, the algorithm yields high- precision estimates for the critical point K(c)=0.333 05(5) and the correlation length exponent nu=0....
متن کاملQuantum Monte Carlo Algorithms for the Quantum Cluster Problem
We present a pedagogical discussion of the the Hirsch-Fye and Continuous time Quantum Monte Carlo (QMC) algorithms which may be used to study a correlated cluster embedded in an uncorrelated host, or used to solve the cluster problem in dynamical mean field theory (DMFT) or its cluster extensions. The basic algorithms are discussed, together with methods for efficient measurments and the modifi...
متن کاملQuantum algorithm for exact Monte Carlo sampling.
We build a quantum algorithm which uses the Grover quantum search procedure in order to sample the exact equilibrium distribution of a wide range of classical statistical mechanics systems. The algorithm is based on recently developed exact Monte Carlo sampling methods, and yields a polynomial gain compared to classical procedures.
متن کاملCluster Monte Carlo Algorithms for Dissipative Quantum Systems
Dissipation and decoherence in quantum systems have important practical implications, from stabilizing superconductivity in granular materials, to the loss of information stored in qubits. In all the models we study, energy dissipation is introduced by coupling a quantum mechanical degree of freedom to a bath of suitably chosen harmonic oscillators. The degrees of freedom of this bath can be in...
متن کاملSingle-Cluster Monte Carlo Dynamics for the Ising Model
We present an extensive study of a new Monte Carlo acceleration algorithm introduced by Wolff for the Ising model. It differs from the Swendsen-Wang algorithm by growing and flipping single clusters at a random seed. In general, it is more efficient than Swendsen-Wang dynamics for d > 2, giving zero critical slowing down in the upper critical dimension. Monte Carlo simulations give dynamical cr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Physical Review E
سال: 2003
ISSN: 1063-651X,1095-3787
DOI: 10.1103/physreve.67.015701